Playing Games with Timed Games

Playing Games with Timed Games

In this paper we focus on property-preserving preorders between timed game automata and their application to control of partially observable systems. Following the example of timed simulation between timed automata, we define timed alternating simulation as a preorder between timed game automata, which preserves controllability. We define a method to reduce the timed alternating simulation prob...

Playing Games with Theorem Provers

The disciplines of Computer Game Playing and Automated Theorem Proving have a lot in common and insights to share. From huge search spaces to heuristics and evaluation function, from learning to domain analysis to competition, both of these areas of Artificial Intelligence have much to gain from each other. This paper describes the use of a logic based language to describe games and a game play...

Playing Games with Genetic Algorithms

In 1987 the first published research appeared which used the Genetic Algorithm as a means of seeking better strategies in playing the repeated Prisoner’s Dilemma. Since then the application of Genetic Algorithms to game-theoretical models has been used in many ways. To seek better strategies in historical oligopolistic interactions, to model economic learning, and to explore the support of coop...

Playing Games with the Law

Playing Hybrid Games with KeYmaera

We propose a new logic, called differential dynamic game logic (dDGL), that adds several game constructs on top of differential dynamic logic (dL) so that it can be used for hybrid games. The logic dDGL is a conservative extension of dL, which we exploit for our implementation of dDGL in the theorem prover KeYmaera. We provide rules for extending the dL sequent proof calculus to handle the dDGL...